5
5.0

Jan 6, 2020
01/20

by
EMMCVPR'97 (1997 : Venice, Italy)

texts

#
eye 5

#
favorite 1

#
comment 0

xii, 548 p. : 24 cm

Topics: Computer vision -- Congresses, Pattern recognition systems -- Congresses, Neural networks (Computer...

25
25

Oct 16, 2014
10/14

by
Berry, Michael W; Browne, Murray

texts

#
eye 25

#
favorite 1

#
comment 0

Includes bibliographical references (p. 105-111) and index

Topics: Algorithms & procedures, Automation of library & information processes, Mathematical...

5
5.0

Jun 30, 2018
06/18

by
Pengfei Liu; Xipeng Qiu; Xuanjing Huang

texts

#
eye 5

#
favorite 0

#
comment 0

Neural network models have shown their promising opportunities for multi-task learning, which focus on learning the shared layers to extract the common and task-invariant features. However, in most existing approaches, the extracted shared features are prone to be contaminated by task-specific features or the noise brought by other tasks. In this paper, we propose an adversarial multi-task learning framework, alleviating the shared and private latent feature spaces from interfering with each...

Topics: Computing Research Repository, Computation and Language

Source: http://arxiv.org/abs/1704.05742

The United States Navy requires radical and innovative ways to model and design multifunction phased array radars. This thesis puts forth the concept that Genetic Algorithms, computer simulations that mirror the natural selection process to develop creative solutions to complex problems, would be extremely well suited in this application. The capability of a Genetic Algorithm to predict adequately the behavior of an array antenna with randomly located elements was verified with expected results...

Topics: Active, Air search radar, Air warfare, Antenna, Antennas, Area air defense, Bi-static radar,...

5
5.0

Jun 30, 2018
06/18

by
Jingjun Han; Liyun Dai; Bican Xia

texts

#
eye 5

#
favorite 0

#
comment 0

A new projection operator based on cylindrical algebraic decomposition (CAD) is proposed. The new operator computes the intersection of projection factor sets produced by different CAD projection orders. In other words, it computes the gcd of projection polynomials in the same variables produced by different CAD projection orders. We prove that the new operator still guarantees obtaining at least one sample point from every connected component of the highest dimension, and therefore, can be...

Topics: Symbolic Computation, Computing Research Repository

Source: http://arxiv.org/abs/1401.4953

12
12

Jun 27, 2018
06/18

by
Alessandro Bessi

texts

#
eye 12

#
favorite 0

#
comment 0

The traditional lower bound estimation method for powerlaw distributions based on the Kolmogorov-Smirnov distance proved to perform better than other competing methods. However, if applied to very large collections of data, such a method can be computationally demanding. In this paper, we propose two alternative methods with the aim to reduce the time required by the estimation procedure. We apply the traditional method and the two proposed methods to large collections of data ($N = 500,000$)...

Topics: Computation, Physics and Society, Statistics, Physics, Applications

Source: http://arxiv.org/abs/1503.05210

7
7.0

Jun 28, 2018
06/18

by
Fadhela Kerdjoudj; Olivier Curé

texts

#
eye 7

#
favorite 0

#
comment 0

In this paper, we present a system to visualize RDF knowledge graphs. These graphs are obtained from a knowledge extraction system designed by GEOLSemantics. This extraction is performed using natural language processing and trigger detection. The user can visualize subgraphs by selecting some ontology features like concepts or individuals. The system is also multilingual, with the use of the annotated ontology in English, French, Arabic and Chinese.

Topics: Computation and Language, Human-Computer Interaction, Computing Research Repository

Source: http://arxiv.org/abs/1510.00244

6
6.0

Jun 29, 2018
06/18

by
Rico Sennrich

texts

#
eye 6

#
favorite 0

#
comment 0

Analysing translation quality in regards to specific linguistic phenomena has historically been difficult and time-consuming. Neural machine translation has the attractive property that it can produce scores for arbitrary translations, and we propose a novel method to assess how well NMT systems model specific linguistic phenomena such as agreement over long distances, the production of novel words, and the faithful translation of polarity. The core idea is that we measure whether a reference...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1612.04629

4
4.0

audio

#
eye 4

#
favorite 0

#
comment 0

Topics: Radio Program, Citizen science, Crowdsourcing, Nuclear physics, Republics, Epidemiology, Member...

Topics: Radio Program, Citizen science, Crowdsourcing, Nuclear physics, Measuring instruments, Statistical...

7
7.0

Jun 30, 2018
06/18

by
Brian Lee Yung Rowe

texts

#
eye 7

#
favorite 0

#
comment 0

A person's interests exist as an internal state and are difficult to define. Since only external actions are observable, a proxy must be used that represents someone's interests. Techniques like collaborative filtering, behavioral targeting, and hashtag analysis implicitly model an individual's interests. I argue that these models are limited to shallow, temporary interests, which do not reflect people's deeper interests or passions. I propose an alternative model of interests that takes...

Topics: Physics, Computing Research Repository, Computation and Language, Social and Information Networks,...

Source: http://arxiv.org/abs/1410.0316

6
6.0

Jun 30, 2018
06/18

by
Lorenzo Ferrone; Fabio Massimo Zanzotto

texts

#
eye 6

#
favorite 0

#
comment 0

Natural language and symbols are intimately correlated. Recent advances in machine learning (ML) and in natural language processing (NLP) seem to contradict the above intuition: symbols are fading away, erased by vectors or tensors called distributed and distributional representations. However, there is a strict link between distributed/distributional representations and symbols, being the first an approximation of the second. A clearer understanding of the strict link between...

Topics: Computing Research Repository, Computation and Language

Source: http://arxiv.org/abs/1702.00764

10
10.0

Jun 28, 2018
06/18

by
Anirban Bhattacharya; Antik Chakraborty; Bani K. Mallick

texts

#
eye 10

#
favorite 0

#
comment 0

We propose an efficient way to sample from a class of structured multivariate Gaussian distributions which routinely arise as conditional posteriors of model parameters that are assigned a conditionally Gaussian prior. The proposed algorithm only requires matrix operations in the form of matrix multiplications and linear system solutions. We exhibit that the computational complexity of the proposed algorithm grows linearly with the dimension unlike existing algorithms relying on Cholesky...

Topics: Statistics, Computation

Source: http://arxiv.org/abs/1506.04778

3
3.0

Jun 28, 2018
06/18

by
P. S. Koutsourelakis

texts

#
eye 3

#
favorite 0

#
comment 0

The present paper proposes a novel Bayesian, computational strategy in the context of model-based inverse problems in elastostatics. On one hand we attempt to provide probabilistic estimates of the material properties and their spatial variability that account for the various sources of uncertainty. On the other hand we attempt to address the question of model fidelity in relation to the experimental reality and particularly in the context of the material constitutive law adopted. This is...

Topics: Statistics, Computation

Source: http://arxiv.org/abs/1512.05913

5
5.0

Jun 29, 2018
06/18

by
Giovanni Da San Martino; Alberto Barrón-Cedeño; Salvatore Romeo; Alessandro Moschitti; Shafiq Joty; Fahad A. Al Obaidli; Kateryna Tymoshenko; Antonio Uva

texts

#
eye 5

#
favorite 0

#
comment 0

This paper studies the impact of different types of features applied to learning to re-rank questions in community Question Answering. We tested our models on two datasets released in SemEval-2016 Task 3 on "Community Question Answering". Task 3 targeted real-life Web fora both in English and Arabic. Our models include bag-of-words features (BoW), syntactic tree kernels (TKs), rank features, embeddings, and machine translation evaluation features. To the best of our knowledge,...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1610.05522

4
4.0

Jun 29, 2018
06/18

by
Liang Sun; Jason Mielens; Jason Baldridge

texts

#
eye 4

#
favorite 0

#
comment 0

Unsupervised models of dependency parsing typically require large amounts of clean, unlabeled data plus gold-standard part-of-speech tags. Adding indirect supervision (e.g. language universals and rules) can help, but we show that obtaining small amounts of direct supervision - here, partial dependency annotations - provides a strong balance between zero and full supervision. We adapt the unsupervised ConvexMST dependency parser to learn from partial dependencies expressed in the Graph Fragment...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1611.08765

10
10.0

Jun 30, 2018
06/18

by
Georg Heigold; Günter Neumann; Josef van Genabith

texts

#
eye 10

#
favorite 0

#
comment 0

This paper investigates the robustness of NLP against perturbed word forms. While neural approaches can achieve (almost) human-like accuracy for certain tasks and conditions, they often are sensitive to small changes in the input such as non-canonical input (e.g., typos). Yet both stability and robustness are desired properties in applications involving user-generated content, and the more as humans easily cope with such noisy or adversary conditions. In this paper, we study the impact of noisy...

Topics: Computing Research Repository, Computation and Language

Source: http://arxiv.org/abs/1704.04441

3
3.0

Jun 30, 2018
06/18

by
Arthur White; Jason Wyse; Thomas Brendan Murphy

texts

#
eye 3

#
favorite 0

#
comment 0

Latent class analysis is used to perform model based clustering for multivariate categorical responses. Selection of the variables most relevant for clustering is an important task which can affect the quality of clustering considerably. This work considers a Bayesian approach for selecting the number of clusters and the best clustering variables. The main idea is to reformulate the problem of group and variable selection as a probabilistically driven search over a large discrete space using...

Topics: Computation, Statistics

Source: http://arxiv.org/abs/1402.6928

7
7.0

Jun 30, 2018
06/18

by
Jing Xi; Seth Sullivant

texts

#
eye 7

#
favorite 0

#
comment 0

In recent years, sequential importance sampling (SIS) has been well developed for sampling contingency tables with linear constraints. In this paper, we apply SIS procedure to 2-dimensional Ising models, which give observations of 0-1 tables and include both linear and quadratic constraints. We show how to compute bounds for specific cells by solving linear programming (LP) problems over cut polytopes to reduce rejections. The computational results, which includes both simulations and real data...

Topics: Optimization and Control, Computation, Combinatorics, Statistics, Statistical Mechanics,...

Source: http://arxiv.org/abs/1410.4217

15
15

Jun 28, 2018
06/18

by
Shaoshi Chen; Christoph Koutschan

texts

#
eye 15

#
favorite 0

#
comment 0

In 1992, Wilf and Zeilberger conjectured that a hypergeometric term in several discrete and continuous variables is holonomic if and only if it is proper. Strictly speaking the conjecture does not hold, but it is true when reformulated properly: Payne proved a piecewise interpretation in 1997, and independently, Abramov and Petkovsek in 2002 proved a conjugate interpretation. Both results address the pure discrete case of the conjecture. In this paper we extend their work to hypergeometric...

Topics: Combinatorics, Computing Research Repository, Mathematics, Symbolic Computation

Source: http://arxiv.org/abs/1507.04840

4
4.0

Jun 29, 2018
06/18

by
Lidong Bing; Mingyang Ling; Richard C. Wang; William W. Cohen

texts

#
eye 4

#
favorite 0

#
comment 0

Distant labeling for information extraction (IE) suffers from noisy training data. We describe a way of reducing the noise associated with distant IE by identifying coupling constraints between potential instance labels. As one example of coupling, items in a list are likely to have the same label. A second example of coupling comes from analysis of document structure: in some corpora, sections can be identified such that items in the same section are likely to have the same label. Such...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1601.00620

Results for trajectory analysis, fuel analysis, and analysis of aerobraking maneuvers are presented. Calculations are included for thickness and mass of the propellant tanks; determination of weight (avionics module); numerical integration program; hydrostatic pressure due to acceleration; and propellant tank pressurization.

Topics: NASA Technical Reports Server (NTRS), COMPUTATION, MISSION PLANNING, NUMERICAL ANALYSIS, ORBIT...

The electromagnetic backscattering of a crosscut of a cruise missile coated by a thin homogeneous layer made of radar absorbent material is modeled using a finite element method. Based on the radar cross section and a reflection coefficient, optimization problems are formulated for evaders and interrogators leading to optimal material parameters for the coating and optimal monostatic radar operating frequencies, respectively. Optimal coating materials are constructed for several radar...

Topics: DTIC Archive, Banks, H T, NORTH CAROLINA STATE UNIV AT RALEIGH CENTER FOR RESEARCH IN SCIENTIFIC...

We present a logistic function of a monotonic polynomial with a lower asymptote, allowing additional flexibility beyond the three-parameter logistic model. We develop a maximum marginal likelihood based approach to estimate the item parameters. The new item response model is demonstrated on math assessment data from a state, and a computationally efficient strategy for choosing the order of the polynomial is demonstrated and tested.

Topics: ERIC Archive, Guessing (Tests), Item Response Theory, Mathematics Instruction, Mathematics Tests,...

Much has been learned about the physics underlying the transition process at supersonic and hypersonic speeds through years of analysis, experiment and computation. Generally, the application of this knowledge has been restricted to simple shapes like plates, cones and spherical bodies. However, flight reentry vehicles are in reality never simple. They typically are highly complex geometries flown at angle of attack so three-dimensional effects are very important, as are roughness effects due...

Topics: NASA Technical Reports Server (NTRS), BOUNDARY LAYER TRANSITION, HYPERSONIC BOUNDARY LAYER, ANGLE...

3
3.0

Jun 30, 2018
06/18

by
Elizabeth Gross; Sonja Petrović; Despina Stasi

texts

#
eye 3

#
favorite 0

#
comment 0

Social networks and other large sparse data sets pose significant challenges for statistical inference, as many standard statistical methods for testing model fit are not applicable in such settings. Algebraic statistics offers a theoretically justified approach to goodness-of-fit testing that relies on the theory of Markov bases and is intimately connected with the geometry of the model as described by its fibers. Most current practices require the computation of the entire basis, which is...

Topics: Mathematics, Computation, Combinatorics, Statistics, Methodology

Source: http://arxiv.org/abs/1401.4896

8
8.0

Jun 26, 2018
06/18

by
Tianran Chen; Dhagash Mehta

texts

#
eye 8

#
favorite 0

#
comment 0

The problem of solving a system of polynomial equations is one of the most fundamental problems in applied mathematics. Among them, the problem of solving a system of binomial equations form a important subclass for which specialized techniques exist. For both theoretic and applied purposes, the degree of the solution set of a system of binomial equations often plays an important role in understanding the geometric structure of the solution set. Its computation, however, is computationally...

Topics: Symbolic Computation, High Energy Physics - Theory, Computing Research Repository, Mathematical...

Source: http://arxiv.org/abs/1501.02237

A high-Reynolds-number, subsonic coannular jet is simulated, using a three-dimensional finite-volume LES method, with emphasis on the near field noise. The nozzle geometry used is the NASA Glenn 3BB baseline model. The numerical results are generally in good agreement with existing experimental findings.

Topics: NASA Technical Reports Server (NTRS), COMPUTATION, NEAR FIELDS, SUBSONIC FLOW, JET FLOW, JET...

6
6.0

Jun 28, 2018
06/18

by
Vivek Kulkarni; Bryan Perozzi; Steven Skiena

texts

#
eye 6

#
favorite 0

#
comment 0

We present a new computational technique to detect and analyze statistically significant geographic variation in language. Our meta-analysis approach captures statistical properties of word usage across geographical regions and uses statistical methods to identify significant changes specific to regions. While previous approaches have primarily focused on lexical variation between regions, our method identifies words that demonstrate semantic and syntactic variation as well. We extend recently...

Topics: Learning, Computation and Language, Information Retrieval, Computing Research Repository

Source: http://arxiv.org/abs/1510.06786

4
4.0

Jun 29, 2018
06/18

by
Khoa T. Tran

texts

#
eye 4

#
favorite 0

#
comment 0

Markov chain Monte Carlo is a class of algorithms for drawing Markovian samples from high-dimensional target densities to approximate the numerical integration associated with computing statistical expectation, especially in Bayesian statistics. However, many Markov chain Monte Carlo algorithms do not seem to share the same theoretical support and each algorithm is proven in a different way. This incurs many terminologies and ancillary concepts, which makes Markov chain Monte Carlo literature...

Topics: Computation, Statistics

Source: http://arxiv.org/abs/1607.01985

9
9.0

Jun 28, 2018
06/18

by
A. Wawrzynczak; R. Modzelewska; M. Kluczek

texts

#
eye 9

#
favorite 0

#
comment 0

We derive the numerical schemes for the strong order integration of the set of the stochastic differential equations (SDEs) corresponding to the non-stationary Parker transport equation (PTE). PTE is 5-dimensional (3 spatial coordinates, particles energy and time) Fokker- Planck type equation describing the non-stationary the galactic cosmic ray (GCR) particles transport in the heliosphere. We present the formulas for the numerical solution of the obtained set of SDEs driven by a Wiener process...

Topics: Solar and Stellar Astrophysics, Astrophysics, Statistics, Computation, Mathematics, Numerical...

Source: http://arxiv.org/abs/1509.06890

6
6.0

Jun 29, 2018
06/18

by
Yu Zhang; William Chan; Navdeep Jaitly

texts

#
eye 6

#
favorite 0

#
comment 0

Sequence-to-sequence models have shown success in end-to-end speech recognition. However these models have only used shallow acoustic encoder networks. In our work, we successively train very deep convolutional networks to add more expressive power and better generalization for end-to-end ASR models. We apply network-in-network principles, batch normalization, residual connections and convolutional LSTMs to build very deep recurrent and convolutional structures. Our models exploit the spectral...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1610.03022

12
12

Jun 28, 2018
06/18

by
Kun Xu; Yansong Feng; Songfang Huang; Dongyan Zhao

texts

#
eye 12

#
favorite 0

#
comment 0

Syntactic features play an essential role in identifying relationship in a sentence. Previous neural network models often suffer from irrelevant information introduced when subjects and objects are in a long distance. In this paper, we propose to learn more robust relation representations from the shortest dependency path through a convolution neural network. We further propose a straightforward negative sampling strategy to improve the assignment of subjects and objects. Experimental results...

Topics: Computation and Language, Computing Research Repository, Learning

Source: http://arxiv.org/abs/1506.07650

3
3.0

Jun 30, 2018
06/18

by
Houying Zhu; Josef Dick

texts

#
eye 3

#
favorite 0

#
comment 0

In this paper we propose an acceptance-rejection sampler using stratified inputs as diver sequence. We estimate the discrepancy of the points generated by this algorithm. First we show an upper bound on the star discrepancy of order $N^{-1/2-1/(2s)}$. Further we prove an upper bound on the $q$-th moment of the $L_q$-discrepancy $(\mathbb{E}[N^{q}L^{q}_{q,N}])^{1/q}$ for $2\le q\le \infty$, which is of order $N^{(1-1/s)(1-1/q)}$. We also present an improved convergence rate for a deterministic...

Topics: Computation, Numerical Analysis, Mathematics, Statistics

Source: http://arxiv.org/abs/1408.1742

8
8.0

Jun 25, 2018
06/18

by
C. Fantacci; B. -T. Vo; F. Papi; B. -N. Vo

texts

#
eye 8

#
favorite 0

#
comment 0

The multi-target Bayes filter proposed by Mahler is a principled solution to recursive Bayesian tracking based on RFS or FISST. The $\delta$-GLMB filter is an exact closed form solution to the multi-target Bayes recursion which yields joint state and label or trajectory estimates in the presence of clutter, missed detections and association uncertainty. Due to presence of explicit data associations in the $\delta$-GLMB filter, the number of components in the posterior grows without bound in...

Topics: Computation, Statistics

Source: http://arxiv.org/abs/1501.00926

The authors investigated benefits of digital technology compared with traditional manipulatives in relation to preschoolers' development and learning of computational skills. The sample consisted of twenty four 4-and 5-year old children who attended a half-day prekindergarten program five times a week in a university laboratory school in the Midwestern United States. Children participated in small group instruction targeting computational skills. In one class, the teacher provided traditional...

Topics: ERIC Archive, Kindergarten, Preschool Children, Preschool Evaluation, Computation, Conventional...

5
5.0

Jun 29, 2018
06/18

by
James Balamuta; Roberto Molinari; Stéphane Guerrier; Wenchao Yang

texts

#
eye 5

#
favorite 0

#
comment 0

The gmwm R package for inference on time series models is mainly based on the quantity called wavelet variance which is derived from a wavelet decomposition of a time series. This quantity provides a means to summarize and graphically represent the features of time series in order to identify possible models. Moreover, it is used as a moment condition for model estimation through the generalized method of wavelet moments. Based on the latter method, this package not only provides an alternative...

Topics: Computation, Statistics

Source: http://arxiv.org/abs/1607.04543

5
5.0

Jun 29, 2018
06/18

by
Trey Grainger; Khalifeh AlJadda; Mohammed Korayem; Andries Smith

texts

#
eye 5

#
favorite 0

#
comment 0

This paper describes a new kind of knowledge representation and mining system which we are calling the Semantic Knowledge Graph. At its heart, the Semantic Knowledge Graph leverages an inverted index, along with a complementary uninverted index, to represent nodes (terms) and edges (the documents within intersecting postings lists for multiple terms/nodes). This provides a layer of indirection between each pair of nodes and their corresponding edge, enabling edges to materialize dynamically...

Topics: Artificial Intelligence, Information Retrieval, Computing Research Repository, Computation and...

Source: http://arxiv.org/abs/1609.00464

9
9.0

Jun 29, 2018
06/18

by
Song Han; Junlong Kang; Huizi Mao; Yiming Hu; Xin Li; Yubin Li; Dongliang Xie; Hong Luo; Song Yao; Yu Wang; Huazhong Yang; William J. Dally

texts

#
eye 9

#
favorite 0

#
comment 0

Long Short-Term Memory (LSTM) is widely used in speech recognition. In order to achieve higher prediction accuracy, machine learning scientists have built larger and larger models. Such large model is both computation intensive and memory intensive. Deploying such bulky model results in high power consumption and leads to high total cost of ownership (TCO) of a data center. In order to speedup the prediction and make it energy efficient, we first propose a load-balance-aware pruning method that...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1612.00694

9
9.0

Jun 28, 2018
06/18

by
Kyunghyun Cho; Aaron Courville; Yoshua Bengio

texts

#
eye 9

#
favorite 0

#
comment 0

Whereas deep neural networks were first mostly used for classification tasks, they are rapidly expanding in the realm of structured output problems, where the observed target is composed of multiple random variables that have a rich joint distribution, given the input. We focus in this paper on the case where the input also has a rich structure and the input and output structures are somehow related. We describe systems that learn to attend to different places in the input, for each element of...

Topics: Computation and Language, Computer Vision and Pattern Recognition, Computing Research Repository,...

Source: http://arxiv.org/abs/1507.01053

7
7.0

Jun 28, 2018
06/18

by
Hui Yu; Xiaofeng Wu; Wenbin Jiang; Qun Liu; Shouxun Lin

texts

#
eye 7

#
favorite 0

#
comment 0

The widely-used automatic evaluation metrics cannot adequately reflect the fluency of the translations. The n-gram-based metrics, like BLEU, limit the maximum length of matched fragments to n and cannot catch the matched fragments longer than n, so they can only reflect the fluency indirectly. METEOR, which is not limited by n-gram, uses the number of matched chunks but it does not consider the length of each chunk. In this paper, we propose an entropy-based method, which can sufficiently...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1508.02225

3
3.0

Jun 29, 2018
06/18

by
Madhav Nimishakavi; Uday Singh Saini; Partha Talukdar

texts

#
eye 3

#
favorite 0

#
comment 0

Given a set of documents from a specific domain (e.g., medical research journals), how do we automatically build a Knowledge Graph (KG) for that domain? Automatic identification of relations and their schemas, i.e., type signature of arguments of relations (e.g., undergo(Patient, Surgery)), is an important first step towards this goal. We refer to this problem as Relation Schema Induction (RSI). In this paper, we propose Schema Induction using Coupled Tensor Factorization (SICTF), a novel...

Topics: Databases, Information Retrieval, Computing Research Repository, Computation and Language

Source: http://arxiv.org/abs/1605.04227

5
5.0

Jun 29, 2018
06/18

by
Ye Zhang; Matthew Lease; Byron C. Wallace

texts

#
eye 5

#
favorite 0

#
comment 0

We propose a new active learning (AL) method for text classification with convolutional neural networks (CNNs). In AL, one selects the instances to be manually labeled with the aim of maximizing model performance with minimal effort. Neural models capitalize on word embeddings as representations (features), tuning these to the task at hand. We argue that AL strategies for multi-layered neural models should focus on selecting instances that most affect the embedding space (i.e., induce...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1606.04212

7
7.0

Jun 29, 2018
06/18

by
Robert Piche

texts

#
eye 7

#
favorite 0

#
comment 0

A linear Gaussian state-space smoothing algorithm is presented for estimation of derivatives from a sequence of noisy measurements. The algorithm uses numerically stable square-root formulas, can handle simultaneous independent measurements and non-equally spaced abscissas, and can compute state estimates at points between the data abscissas. The state space model's parameters, including driving noise intensity, measurement variance, and initial state, are determined from the given data...

Topics: Methodology, Computation, Statistics

Source: http://arxiv.org/abs/1610.04397

4
4.0

texts

#
eye 4

#
favorite 0

#
comment 0

2 volumes : 25 cm

Topics: High performance computing, Programmierung, Computerarchitektur, Cluster Rechnernetz, Arquitetura e...

Topics: Radio Program, Concepts in physics, Decision theory, Models of computation, Cooking techniques,...

6
6.0

Sep 18, 2020
09/20

by
Fogel, David B

texts

#
eye 6

#
favorite 1

#
comment 0

xix, 270 pages : 24 cm

Topics: Computer simulation, Artificial intelligence, Evolutionary computation, Simulation par ordinateur,...

This paper addresses the modeling of strains and forces generated by magnetostrictive transducers in response to applied magnetic fields. The magnetostrictive effect is modeled by considering both the rotation of magnetic moments in response to the field and the elastic vibrations in the transducer. The former is modeled with the Jiles-Atherton model of ferromagnetic hysteresis in combination with a quartic magnetostriction law. The latter is modeled through force balancing which yields a PDE...

Topics: DTIC Archive, Dapino, Marcelo J, NORTH CAROLINA STATE UNIV AT RALEIGH CENTER FOR RESEARCH IN...

4
4.0

Jun 29, 2018
06/18

by
Makbule Gulcin Ozsoy

texts

#
eye 4

#
favorite 0

#
comment 0

Social network platforms can use the data produced by their users to serve them better. One of the services these platforms provide is recommendation service. Recommendation systems can predict the future preferences of users using their past preferences. In the recommendation systems literature there are various techniques, such as neighborhood based methods, machine-learning based methods and matrix-factorization based methods. In this work, a set of well known methods from natural language...

Topics: Information Retrieval, Social and Information Networks, Computation and Language, Computing...

Source: http://arxiv.org/abs/1601.01356

9
9.0

Jun 27, 2018
06/18

by
E. G. Eferina; A. V. Korolkova; M. N. Gevorkyan; D. S. Kulyabov; L. A. Sevastyanov

texts

#
eye 9

#
favorite 0

#
comment 0

Background. It is assumed that the introduction of stochastic in mathematical model makes it more adequate. But there is virtually no methods of coordinated (depended on structure of the system) stochastic introduction into deterministic models. Authors have improved the method of stochastic models construction for the class of one-step processes and illustrated by models of population dynamics. Population dynamics was chosen for study because its deterministic models were sufficiently well...

Topics: Symbolic Computation, Computing Research Repository

Source: http://arxiv.org/abs/1503.07342